Dynamic Vehicle Routing Problem with Multiple Depots
نویسندگان
چکیده
منابع مشابه
Supply Allocation and Vehicle Routing Problem with Multiple Depots in Large-Scale Emergencies*
Large-scale emergencies, such as substantial acts of nature, large human-caused accidents, and major terrorist attacks, are of high-consequence, low-probability (HCLP) events that may result in loss of life and severe property damage. In recent years, developing decision-oriented operations researchmodels to improve preparation for and response to major emergencies has drawn more and more atten...
متن کامل0 Supply Allocation and Vehicle Routing Problem with Multiple Depots in Large - Scale Emergencies
Large-scale emergencies, such as substantial acts of nature, large human-caused accidents, and major terrorist attacks, are of high-consequence, low-probability (HCLP) events that may result in loss of life and severe property damage. In recent years, developing decision-oriented operations researchmodels to improve preparation for and response to major emergencies has drawn more and more atten...
متن کاملA dynamic vehicle routing problem with multiple delivery routes
This paper considers a vehicle routing problem where each vehicle performs delivery operations over multiple routes during its workday and where new customer requests occur dynamically. The proposed methodology for addressing the problem is based on an adaptive large neighborhood search heuristic, previously developed for the static version of the problem. In the dynamic case, multiple possible...
متن کاملThe Prize-Collecting Vehicle Routing Problem with Single and Multiple Depots and Non-Linear Cost
In this paper, we propose a new routing problem to model a highly relevant planning task in small package shipping. We consider the Prize-Collecting Vehicle Routing Problem with Non-Linear cost (PCVRPNL) in its single and multi-depot version, which integrates the option of outsourcing customers to subcontractors instead of serving them with the private fleet. Thereby, a lower bound on the total...
متن کاملMulti-Phase Meta-Heuristic for Multi-Depots Vehicle Routing Problem
In this work, we present a multi-phase hybrid algorithm based on clustering to solve the multi-depots vehicle routing problem (MDVRP). The proposed algorithm initially adopts K-means algorithm to execute the clustering analyses, which take the depots as the centroids of the clusters, for the all customers of MDVRP, then implements the local depth search using the Shuffled Frog Leaping Algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Engineering Journal
سال: 2014
ISSN: 0125-8281
DOI: 10.4186/ej.2014.18.4.135